Deterministic Small-World Network Extended From Triangles
نویسندگان
چکیده
Small-world networks are abundant in nature and society, describing such diverse systems as the World Wide Web, communication networks or the neuronal network of the worm C.elegans. In the past ten years, many small-world network models have been proposed in both probabilistic and deterministic fashions. In this letter, we propose a new deterministic small-world model by simply extending triangles. Furthermore, we analytically solve the main characteristics of the model and the results show that it is indeed a kind of small-world networks.
منابع مشابه
Counting triangles, tunable clustering and the small-world property in random key graphs (Extended version)
Random key graphs were introduced to study various properties of the Eschenauer-Gligor key predistribution scheme for wireless sensor networks (WSNs). Recently this class of random graphs has received much attention in contexts as diverse as recommender systems, social network modeling, and clustering and classification analysis. This paper is devoted to analyzing various properties of random k...
متن کامل"Tri, Tri Again": Finding Triangles and Small Subgraphs in a Distributed Setting - (Extended Abstract)
Let G = (V,E) be an n-vertex graph and Md a d-vertex graph, for some constant d. Is Md a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(logn) bits. A simple deterministic algorithm that requires O(n(d−2)/d/ logn) communication rounds is presented. For the special case that Md is a triangle, we pres...
متن کاملOn existence of triangles, clustering, and small-world property of random key graphs
Random key graphs have been introduced about a decade ago in the context of key predistribution schemes for securing wireless sensor networks (WSNs). They have received much attention recently with applications spanning the areas of recommender systems, epidemics in social networks, cryptanalysis, and clustering and classification analysis. This paper is devoted to analyzing various properties ...
متن کاملOn the Average Path Length of Deterministic and Stochastics Recursive Networks
The average shortest path distance ` between all pairs of nodes in real-world networks tends to be small compared to the number of nodes. Providing a closed-form formula for ` remains challenging in several network models, as shown by recent papers dedicated to this sole topic. For example, Zhang et al. proposed the deterministic model ZRG and studied an upper bound on `. In this paper, we use ...
متن کاملA deterministic small-world network
Small-world networks are ubiquitous in nature and society, describing such diverse systems as the World Wide Web, the neuronal network of the worm C. elegans, and the friendship network. Most small-world models are stochastic, that is, they create networks where the nodes appear to be randomly connected to each other. Here we propose a simple model that generates a small-world network in a simp...
متن کامل